A Type Reduction from Proof-conditional to Dynamic Semantics
نویسنده
چکیده
Dynamic and proof-conditional approaches to discourse (exemplified by Discourse Representation Theory and Type-Theoretical Grammar, respectively) are related through translations and transitions labeled by first-order formulas with anaphoric twists. Type-theoretic contexts are defined relative to a signature and instantiated model-theoretically, subject to change.
منابع مشابه
Dynamic Cross Hedging Effectiveness between Gold and Stock Market Based on Downside Risk Measures: Evidence from Iran Emerging Capital Market
This paper examines the hedging effectiveness of gold futures for the stock market in minimizing variance and downside risks, including value at risk and expected shortfall using data from the Iran emerging capital market during four different sub-periods from December 2008 to August 2018. We employ dynamic conditional correlation models including VARMA-BGARCH (DCC, ADCC, BEKK, and ABEKK) and c...
متن کاملFull Abstraction for a Recursively Typed Lambda Calculus with Parallel Conditional
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a restricted form, which we call prime systems. A denotational semantics is defined with this interpretation. We define the syntactical normal form approximati...
متن کاملVerification of Java card programs
syntax tree, 13annotated, 13addarray, 40, 41addarrays, 41addclass, 26, 55addobj, 26algebraic specifications, 23allsupers, 32antecedent, 63array accessproof rule, 78semantics, 35array assignmentproof rule, 79semantics, 37array creationproof rule, 81semantics, 40array initializerproof rule, 82semantics, 41ArrayAcc...
متن کاملDynSem: A DSL for Dynamic Semantics Specification
The formal semantics of a programming language and its implementation are typically separately defined, with the risk of divergence such that properties of the formal semantics are not properties of the implementation. In this paper, we present DynSem, a domain-specific language for the specification of the dynamic semantics of programming languages that aims at supporting both formal reasoning...
متن کاملProving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in the framework of a reduction semantics. For that purpose, we use a syntax-directed version of the typing rules: we prove mechanically its equivalence with the initial type system provided by Damas and Milner. This wor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Philosophical Logic
دوره 30 شماره
صفحات -
تاریخ انتشار 2001